A subdomain boundary element method for high‐Reynolds laminar flow using stream function‐vorticity formulation

The paper presents a new formulation of the integral boundary element method (BEM) using subdomain technique. A continuous approximation of the function and the function derivative in the direction normal to the boundary element (further ‘normal flux’) is introduced for solving the general form of a parabolic diffusion‐convective equation. Double nodes for normal flux approximation are used. The gradient continuity is required at the interior subdomain corners where compatibility and equilibrium interface conditions are prescribed. The obtained system matrix with more equations than unknowns is solved using the fast iterative linear least squares based solver. The robustness and stability of the developed formulation is shown on the cases of a backward‐facing step flow and a square‐driven cavity flow up to the Reynolds number value 50 000. Copyright © 2004 John Wiley & Sons, Ltd.     

Fast algorithms for determining the linear complexities of sequences over GF(pm) with the period 3n

In this paper, for the the primes p such that 3 is a divisor of p − 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(p ^m) (any positive integer m) with the period 3n (n and p ^m − 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-Imamura algorithm, we can determine the linear complexity of any sequence over GF(p ^m) with the period 3n (n and p ^m − 1 are coprime) more efficiently.     

A novel method for automated grid generation of ice shapes for local‐flow analysis

Modelling a complex geometry, such as ice roughness, plays a key role for the computational flow analysis over rough surfaces. This paper presents two enhancement ideas in modelling roughness geometry for local flow analysis over an aerodynamic surface. The first enhancement is use of the leading‐edge region of an airfoil as a perturbation to the parabola surface. The reasons for using a parabola as the base geometry are: it resembles the airfoil leading edge in the vicinity of its apex and it allows the use of a lower apparent Reynolds number. The second enhancement makes use of the Fourier analysis for modelling complex ice roughness on the leading edge of airfoils. This method of modelling provides an analytical expression, which describes the roughness geometry and the corresponding derivatives. The factors affecting the performance of the Fourier analysis were also investigated. It was shown that the number of sine–cosine terms and the number of control points are of importance. Finally, these enhancements are incorporated into an automated grid generation method over the airfoil ice accretion surface. The validations for both enhancements demonstrate that they can improve the current capability of grid generation and computational flow field analysis around airfoils with ice roughness. Copyright © 2004 John Wiley & Sons, Ltd.     

A fourth‐order compact finite difference scheme for the steady stream function–vorticity formulation of the Navier–Stokes/Boussinesq equations

A fourth‐order compact finite difference scheme on the nine‐point 2D stencil is formulated for solving the steady‐state Navier–Stokes/Boussinesq equations for two‐dimensional, incompressible fluid flow and heat transfer using the stream function–vorticity formulation. The main feature of the new fourth‐order compact scheme is that it allows point‐successive overrelaxation (SOR) or point‐successive underrelaxation iteration for all Rayleigh numbers Ra of physical interest and all Prandtl numbers Pr attempted. Numerical solutions are obtained for the model problem of natural convection in a square cavity with benchmark solutions and compared with some of the accurate results available in the literature. Copyright © 2003 John Wiley & Sons, Ltd.     

A stream tube model for miscible flow

A simple theoretical model is described for deriving a 1-dimensional equation for the spreading of a tracer in a steady flow at the field scale. The originality of the model is to use a stochastic appoach not in the 3-dimensional space but in the 1-D space of the stream tubes. The simplicity of calculation comes from the local relationship between permeability and velocity in a 1-D flow. The spreading of a tracer front is due to local variations in the cross-sectional area of the stream tubes, which induces randomness in travel time. The derived transport equation is averaged in the main flow direction. It differs from the standard dispersion equation. The roles of time and space variables are exchanged. This result can be explained by using the statistical theory of Continuous Time Random Walk instead of a standard Random Walk. However, the two equations are very close, since their solutions have the same first and second moments. Dispersivity is found to be equal to the product of the correlation length by the variance of the logarithm of permeability, a result similar to Gelhar's macrodispersion.Nomenclature A total cross-section area of the sample - C (resident) concentration of tracer - D,D ^* dispersion coefficient - F flux of tracer - G probability distribution function for permeability in the stream-tube segments - I tracer intensity (mass crossing a surface per unit time) - K permeability - L length of the medium - M number of stream tubes in the medium - N number of segments along a stream tube - P pressure - Q total flow rate in the sample - a length of an elementary stream-tube segment - g probability distribution function for permeability in the space - i, j indices, tube numbers - q flow rate in each stream tube - s variable cross-section area of a stream tube - t, t time - u front velocity - x space variable in the flow direction - small local variation in time - , _t longitudinal, transverse dispersivity - porosity of the porous medium - correlation length in the permeability field - viscosity of the fluid - time for filling an elementary stream tube segment - standard deviation of a stochastic variable - probability distribution of arrival times (Gaussian)     

Linearization of nonlinear filter generators and its application to cryptanalysis of stream ciphers

Nonlinear filter generators are commonly used as keystream generators in stream ciphers. A nonlinear filter generator utilizes a nonlinear filtering function to combine the outputs of a linear feedback shift register (LFSR) to improve the linear complexity of keystream sequences. However, the LFSR-based stream ciphers are still potentially vulnerable to algebraic attacks that recover the key from some keystream bits. Although the known algebraic attacks only require polynomial time complexity of computations, all have their own constraints. This paper uses the linearization of nonlinear filter generators to cryptanalyze LFSR-based stream ciphers. Such a method works for any nonlinear filter generators. Viewing a nonlinear filter generator as a Boolean network that evolves as an automaton through Boolean functions, we first give its linearization representation. Compared to the linearization representation in Limniotis et al. (2008), this representation requires lower spatial complexity of computations in most cases. Based on the representation, the key recoverability is analyzed via the observability of Boolean networks. An algorithm for key recovery is given as well. Compared to the exhaustive search to recover the key, using this linearization representation requires lower time complexity of computations, though it leads to exponential time complexity.     

Towards a Computational Comparative Neuroprimatology: Framing the language-ready brain

We make the case for developing a Computational Comparative Neuroprimatology to inform the analysis of the function and evolution of the human brain.First, we update the mirror system hypothesis on the evolution of the language-ready brain by (i) modeling action and action recognition and opportunistic scheduling of macaque brains to hypothesize the nature of the last common ancestor of macaque and human (LCA-m); and then we (ii) introduce dynamic brain modeling to show how apes could acquire gesture through ontogenetic ritualization, hypothesizing the nature of evolution from LCA-m to the last common ancestor of chimpanzee and human (LCA-c). We then (iii) hypothesize the role of imitation, pantomime, protosign and protospeech in biological and cultural evolution from LCA-c to Homo sapiens with a language-ready brain.Second, we suggest how cultural evolution in Homo sapiens led from protolanguages to full languages with grammar and compositional semantics.Third, we assess the similarities and differences between the dorsal and ventral streams in audition and vision as the basis for presenting and comparing two models of language processing in the human brain: A model of (i) the auditory dorsal and ventral streams in sentence comprehension; and (ii) the visual dorsal and ventral streams in defining “what language is about” in both production and perception of utterances related to visual scenes provide the basis for (iii) a first step towards a synthesis and a look at challenges for further research.     

Wavelet bases in

Some years ago, compactly supported divergence-free wavelets were constructed which also gave rise to a stable (biorthogonal) wavelet splitting of . These bases have successfully been used both in the analysis and numerical treatment of the Stokes and Navier-Stokes equations. In this paper, we construct stable wavelet bases for the stream function spaces . Moreover, -free vector wavelets are constructed and analysed. The relationship between and are expressed in terms of these wavelets. We obtain discrete (orthogonal) Hodge decompositions.

Our construction works independently of the space dimension, but in terms of general assumptions on the underlying wavelet systems in that are used as building blocks. We give concrete examples of such bases for tensor product and certain more general domains . As an application, we obtain wavelet multilevel preconditioners in and .

     

Spatial structure and energy spectrum of ion beams studied with CN detectors within a small PF device

The paper reports the application of Solid-State Nuclear Track Detectors to study the pulsed plasma-ion streams emitted from plasma-focus (PF) type discharges, which were performed within a low-energy PACO device constructed at Instituto de Fisica Arroyo Seco. The PACO device was operated under static initial gas conditions or with dynamic gas puffing. Studies of the structure of the fast deuteron beams were carried out within an energy range from 80 keV to about 2 MeV. Studies of ion energy and an ion angular distribution were also performed. The measurements showed that the fast deuterons are emitted in many “narrow” micro-beams, as in other larger PF devices. The anisotropy of the deuteron angular distribution was explained by the stochastic character of the formation of local ion sources within the PF discharge column.     

Modified constructions of binary sequences using multiplicative inverse

Two new families of finite binary sequences are constructed using multiplicative inverse. The sequences are shown to have strong pseudorandom properties by using some estimates of certain exponential sums over finite fields. The constructions can be implemented fast since multiplicative inverse over finite fields can be computed in polynomial time.